Computer graphics systems and methods generating smooth feature lines for subdivision surfaces

ABSTRACT

Computer graphics systems and methods are provided for generating a representation of a feature in a surface defined by a mesh representation, the mesh comprising at a selected level a plurality of points including at least one point connected to a plurality of neighboring points by respective edges, the feature being defined in connection with the vertex and at least one of the neighboring points and the edge interconnection the vertex and the at least one of the neighboring points in the mesh representation. The feature generating arrangement comprises a weight vector generator module and a feature representation generator module.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No. 10/062,192 filed Feb. 1, 2002 now U.S. Pat. No. 7,277,094, which claims priority benefit of U.S. Provisional Patent Application 60/265,855 filed Feb. 1, 2001, each of which is incorporated by reference herein as if set forth in its entirety.

FIELD OF THE INVENTION,

The invention relates generally to the field of computer graphics and more specifically to generation of smooth feature lines on subdivision surfaces representing surfaces of objects.

BACKGROUND OF THE INVENTION

Generally, in computer graphics, objects are represented as surfaces with the surfaces being represented by meshes at a particular level. A mesh at particular consists of a set of vertices, or points in three-dimensional space, which are interconnected by edges. The edges define polygonal faces, which may be in the form of triangles, quadrilaterals, and so forth. In some computer graphic operations it is desirable to generate a representation of a surface at a finer resolution than a current representation. There are several popular methodologies for generating a representation of a surface at a finer resolution than a current representation, including a Catmull-Clark surface subdivision methodology, which is used in connection with surfaces defined by a quadrilateral mesh, and a Loop surface subdivision methodology, which is used in connection with surface defined by a triangular mesh. Generally, both methodologies make use of respective subdivision rules at respective vertices defining the surface at a particular level in the mesh to generate a mesh in a next higher subdivision level. The surface of the respective object, which is referred to as the “subdivision surface” or “limit surface,” is taken as being defined by a mesh as the subdivision level approaches infinity.

A feature on a subdivision surface can be defined by a feature line in the mesh that defines the respective surface. A feature line can be in the form of a sharp crease or smooth curve. For a smooth feature line, a normal vector, which is the vector that is perpendicular to a plane that is tangent to the surface, will vary continuously across the smooth feature line. On the other hand, for a sharp crease. However, a definition for a smooth curve can be derived form a definition for a sharp crease using one or more parameters that are used to define the sharpness of the curve across vertices in the mesh at a particular subdivision level. D. Zorin, “Stationary Subdivision And Multi-Resolution Surface Representation.” Ph.D. Thesis, California Institute of Technology, Pasadena, Calif., 1998, describes a methodology for generating a smooth feature line using parameters, but the methodology described there results in surfaces of relatively low quality, even in surfaces that are not smooth at some vertices in the surface topology. T. DeRose, et al., “Subdivision surfaces in character animation,” SIGGRAPH 98 Conference Proceedings, Annual Conference Series, pages 85-94, ACM SIGGRAPH, 1998, describes a methodology for generating a smooth feature line based on applying a subdivision rule corresponding to sharp creases, as described in H. Hoppe, et al., “Piecewise Smooth Surface reconstruction,” SIGGRAPH 94 Conference Proceedings, Annual Conference Series, ACM SIGGRAPH, 1994, up to a selected fineness level, and a rule corresponding to smooth interior points thereafter. Applying the two distinctly different types of rules makes efficient evaluation of the resulting surface difficult.

SUMMARY OF THE INVENTION

The invention provides a new and improved system and method for generating a smooth feature line in a subdivision surface.

In brief summary, the invention provides an arrangement for generating a representation of a feature in a surface defined by a mesh representation, the mesh comprising at a selected level a plurality of points including at least one point connected to a plurality of neighboring points by respective edges, the feature being defined in connection with the vertex and at least one of the neighboring points and the edge interconnecting the vertex and the at least one of the neighboring points in the mesh representation. The feature generating arrangement comprises a weight vector generator module and a feature representation generator module. The weight vector generator module is configured to generate at least one weight vector based on a parameterized subdivision rule defined at a plurality of levels, for which a value of at least one parameter differs at at least two levels in the mesh. The feature representation generator module configured to use the at least one weight vector and positions of the vertex and the neighboring points to generate the representation of the feature.

One embodiment of the invention comprises an arrangement for generating a smooth feature line in the subdivision surface.

BRIEF DESCRIPTION OF THE DRAWINGS

This invention is pointed out with particularity in the appended claims. The above and further advantages of this invention may be better understood by referring to the following description taken in conjunction with the accompanying drawings, in which:

FIG. 1 depicts a computer graphics system including an arrangement for generating a smooth feature line in a subdivision surface, constructed in accordance with the invention;

FIG. 2 depicts a mesh representing a surface to which the Loop surface subdivision methodology has been applied;

FIG. 3 depicts a stencil useful in understanding the Loop surface subdivision methodology;

FIGS. 4A through 4E depict a mesh representing a surface to which the Catmull-Clark surface subdivision methodology has been applied;

FIG. 5 depicts a stencil useful in understanding the Catmull-Clark surface subdivision methodology;

FIG. 6 depicts a stencil useful in understanding a methodology for generating a sharp crease on a subdivision surface;

FIG. 7 depicts a stencil useful in understanding a methodology for generating a smooth feature line used in connection with subdivision surfaces defined by triangular meshes;

FIGS. 8 and 9 depict tables of coefficients used in the methodology used in connection with surfaces defined by triangular meshes described in connection with FIG. 7;

FIG. 10 depicts a flow chart describing operations performed by the computer graphics system in connection with the methodology used in connection with surfaces defined by triangular meshes described in connection with FIG. 7;

FIG. 11 depicts a stencil useful in understanding a methodology for generating a smooth feature line used in connection with subdivision surfaces defined by quadrilateral meshes;

FIGS. 12 and 13 depict tables of coefficients used in the methodology used in connection with surfaces defined by quadrilateral meshes described in connection with FIG. 11.

DETAILED DESCRIPTION OF AN ILLUSTRATIVE EMBODIMENT

FIG. 1 depicts a computer graphics system 10 including an arrangement for generating a smooth feature line in connection with a subdivision surface, constructed in accordance with the invention. With reference to FIG. 1, the computer graphics system includes a processor module 11, one or more operator input devices 12 and one or more display devices 13. The display device(s) 13 will typically comprise a frame buffer, video display terminal or the like, which will display information in textual and/or graphical form on a display screen to the operator. The operator input devices 12 for a computer graphics system 10 will typically include a pen 14 which is typically used in conjunction with a digitizing tablet 15, and a trackball or mouse device 16. Generally, the pen 14 and digitizing tablet will be used by the operator in several modes. In one mode, the pen 14 and digitizing tablet are used to provide updated shading information to the computer graphics system. In other modes, the pen and digitizing tablet are used by the operator to input conventional computer graphics information, such as line drawing for, for example, surface trimming and other information, to the computer graphics system 10, thereby to enable the system 10 to perform conventional computer graphics operations. The trackball or mouse device 16 can be used to move a cursor or pointer over the screen to particular points in the image at which the operator can provide input with the pen and digitizing tablet. The computer graphics system 10 may also include a keyboard (not shown) which the operator can use to provide textual input to the system 10.

The processor module 11 generally includes a processor, which may be in the form of one or more microprocessors, a main memory, and will generally include one a mass storage subsystem including one or more disk storage devices. The memory and disk storage devices will generally store data and programs (collectively, “information”) to be processed by the processor, and will store processed data which has been generated by the processor. The processor module includes connections to the operator input device(s) 12 and the display device(s) 13, and will receive information input by the operator through the operator input device(s) 12, process the input information, store the processed information in the memory and/or mass storage subsystem. In addition, the processor module can provide video display information, which can form part of the information obtained from the memory and disk storage device as well as processed data generated thereby, to the display device(s) for display to the operator. The processor module 11 may also include connections (not shown) to hardcopy output devices such as printers for facilitating the generation of hardcopy output, modems and/or network interfaces (also not shown) for connecting the system 10 to the public telephony system and/or in a computer network for facilitating the transfer of information, and the like.

The invention provides an arrangement for generating a smooth feature line in a three-dimensional subdivision surface. The subdivision surface, in turn, is defined by control points that are interconnected by edges to form a three-dimensional mesh. Generally, a subdivision surface is initially defined by a mesh at a particular degree of granularity or fineness. Using one of several methodologies, the mesh can be refined through a series of levels of increasing subdivision levels, with the subdivision surface being the limit as the subdivision level approaches infinity. In the following, the each mesh level will be identified an index, with one mesh level being identified by index “j” and the next higher subdivision level mesh being identified by index “j+1.” The subdivision surface is essentially defined by the positions of the surface's “limit points,” which are the essentially the control points as the subdivision level approaches infinity, and the orientations of the associated normal vectors. Each normal vector defines the orientation of a tangent plane at the respective point on the subdivision surface and, in turn, can be defined by the cross product of vectors that are tangent to the subdivision surface at the respective point.

Before describing the operations performed by the smooth feature line generating arrangement, it would be helpful to describe two surface subdivision methodologies, namely the aforementioned Loop surface subdivision methodology and a Catmull-Clark surface subdivision methodology, with which the arrangement is used.

Loop's surface subdivision methodology will be described in connection with FIGS. 2 and 3. FIG. 2 depicts a portion of an illustrative surface defined by a mesh, and a subdivision surface derived therefrom, and FIG. 3 depicts a stencil useful in understanding the surface subdivision methodology. Generally, in Loop's surface subdivision methodology, each triangular face in the original mesh is split into a plurality of subfaces, the subfaces defining the next higher subdivision level mesh. The vertices of the next higher subdivision level mesh are positioned using weighted averages of the positions of the vertices in the original mesh. More specifically, and with reference to FIG. 2, a mesh 20 at a “j” subdivision level is depicted that includes a vertex v_(q) (vertex v_(q)=v_(q)(0)) 21(0) located at position c^(j)(q), and a plurality “K” of surrounding points v_(q)(1) through v_(q)(K) (generally, v_(q)(k))21(1) through 21(K) (generally identified by reference numeral 21(k)) located at positions at respective positions c^(j)(1) through c^(j)(K), the points v_(q)(k)21(k) being those points in the mesh 20 that are connected to vertex v_(q) by edges. (“K,” the number of points connected to vertex v_(q) will sometimes be referred to as the vertex's “valence.”) The stencil depicted in FIG. 3 is useful in understanding the ordering of the index “k” for the points surrounding the respective vertex v_(q). Denoting the set of the indices of the points v_(q)(k) in the mesh that are connected to vertex v_(q) by N(q,j), a mesh at the next higher subdivision level “j+1” corresponds to vertex v′_(q) 22(0) located at position c^(j+1)(q) and a set of surrounding points v′_(q)(1)22(1) at located at positions c^(j+1)(1) and connected to the vertex v′_(q) 22(0). The higher subdivision level mesh is constructed by providing the vertex v′_(q) 22(0) at a position c^(j+1)(q) that is determined by

$\begin{matrix} {{c^{j + 1}(q)} = {{\left( {1 - {a(K)}} \right){c^{j}(q)}} + {\frac{a(K)}{K}{\sum\limits_{k \in {N{({q,j})}}}{c^{j}(k)}}}}} & (1) \end{matrix}$ and points v′_(q)(1)22(1) at positions c^(j+1)(1) that are determined by

$\begin{matrix} {{{c^{j + 1}(l)} = {{\frac{3}{8}\left\lbrack {{c^{j}(q)} + {c^{j}(k)}} \right\rbrack} + {\frac{1}{8}\left\lbrack {{c^{j}\left( {k - 1} \right)} + {c^{j}\left( {k + 1} \right)}} \right\rbrack}}},{k = 1},\ldots\mspace{11mu},K,} & (2) \end{matrix}$ where the weighting factor a(K) is given by

$\begin{matrix} {{a(K)} = {\frac{5}{8} - {\left( \frac{3 + {2{\cos\left( \frac{2\pi}{K} \right)}}}{8} \right)^{2}.}}} & (3) \end{matrix}$

Equations (1) and (2) can be summarized in a single equation defining a subdivision rule using a subdivision matrix S_(T,K) (where index “T” refers to “Triangular”) as follows c ^(j+1) =S _(T,K) c ^(j)  (4), which may be written component-wise as

$\begin{matrix} {{\left( c^{j + 1} \right)_{l} = {\sum\limits_{m}{\left( S_{T,K} \right)_{l,m}\left( c^{j} \right)_{m}}}},{where}} & (5) \\ {\left( S_{T,K} \right)_{l,m} = \left\{ \begin{matrix} {1 - {a(K)}} & {{{if}\mspace{14mu} l} = 0} & {m = 0} \\ \frac{a(K)}{2} & {{{{if}\mspace{14mu} l} = 0},} & {{m = 1},\ldots\mspace{11mu},K} \\ \frac{3}{8} & \begin{matrix} {{{{if}\mspace{14mu} l} = 1},{\ldots\mspace{11mu} K},} \\ {{{{or}\mspace{14mu} l} = {m = 1}},\ldots\mspace{11mu},K} \end{matrix} & \begin{matrix} {m = 0} \\ \; \end{matrix} \\ \begin{matrix} \frac{1}{8} \\ \; \\ \; \\ \; \end{matrix} & \begin{matrix} {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{11mu},K,} \\ {{{{or}\mspace{14mu} l} = 1},} \\ {{{{or}\mspace{14mu} l} = 1},\ldots\mspace{11mu},K,} \\ {{{{or}\mspace{14mu} l} = K},} \end{matrix} & \begin{matrix} {m = {l - 1}} \\ {m = K} \\ {m = {l + 1}} \\ {m = 1} \end{matrix} \\ 0 & {{otherwise},} & \; \end{matrix} \right.} & (6) \end{matrix}$ where indices “l” and “m” range from “zero” to, and including, “K.”

Equations (1) and (2), or equivalently equations (4) through (6), are applied by selecting each point in the mesh at subdivision level “j” as a vertex, to provide points for the mesh at the subdivision level “j+1.” Loop's surface subdivision methodology can be applied recursively to provide a mesh at any desired subdivision level. It will be appreciated that equation (2) will provide that the point v′_(q)(1)22(1) that is created when the methodology is applied to point v_(q) 21(0) as the vertex will be in the same position when the methodology is applied to point v_(q)(k)21(k) as the vertex.

It will be appreciated that, the Loop surface subdivision methodology provides

(i) one new point (reference points v′_(q)(1) described above), at location c^(j+1)(1) in the next higher (“j+1”) subdivision level mesh, for, and generally somewhere between, each pair of points in the level “j” mesh, and

(ii) a relocated point (reference vertex v′_(q) described above), at location c^(j+1)(q) in the “j+1” level mesh for, and generally somewhat near, each point in the “j” level mesh,

which are interconnected to form the “j+1” level mesh.

The Catmull-Clark subdivision methodology produces smooth surfaces using a small number of neighboring vertices. The Catmull-Clark surface subdivision methodology will be described in connection with FIGS. 4A through 4E and 5. FIG. 4A depicts an illustrative surface defined by a mesh, and FIGS. 4B through 4E are useful in understanding operations performed in generating a subdivision surface derived from the surface depicted in FIG. 4A. FIG. 5 depicts a stencil useful in understanding the surface subdivision methodology, and in particular is useful in understanding the ordering of the index “k” for the points surrounding the vertex v_(q) (vertex v_(q)=v_(q)(0)) around which the surface subdivision methodology is to be performed. With reference to FIG. 4A, that FIG. depicts a mesh 30 consisting of four quadrilaterals 31(1) through 31(4). Each quadrilateral is referred to as a face. The quadrilaterals are defined by points 32(0), which is common to all of the quadrilaterals 31(1) through 31(4), and other points 32(1) through 32(8). Generally, the Catmull-Clark surface subdivision methodology is performed in a series of iterations, including

(i) a face point generation iteration, in which, for each face, a face point 33(1) through 33(4) is generated as the average of the points 32(p) defining the respective face (reference FIG. 4B);

(ii) an edge point generation iteration in which, for each edge, a new edge point 34(1) through 34(4) is generated as the average of the midpoint of the original edge with the two new face points of the faces adjacent to the edge (reference FIG. 4C; the face points generated during the face point generation iteration are shown as circles);

(iii) a vertex point iteration in which a vertex point 35 is generated in relation to the positions of the new face points generated in iteration (i) for faces that are adjacent to the original vertex point, the positions of the midpoints of the original edges that are incident on the original vertex point, the position of the original vertex point, and the valence of the original vertex point (reference FIG. 4D; the face and edge points generated during the face point and edge point generation iterations are shown as circles); and

(iv) a mesh connection step (reference FIG. 4E) in which:

-   -   (a) each new face point is connected to the edge points of the         edges defining the original face; and     -   (b) each new vertex point is connected to the new edge points of         all original edges incident on the original vertex point.

More specifically, in the Catmull-Clark subdivision methodology, denoting, for a vertex v_(q) at location c^(j)(q),

(i) the set of indices of first-order neighboring points c^(j)(1) that are connected thereto (for example, for point 32(0), point 32(2) and 32(8)) by N_(e)(q,j), and

(ii) the set of indices of second-order neighboring points that are opposite to vertex c^(j)(q) with respect to the level “j” faces (for example, for point 32(0), point 32(1)) that are incident with vertex c^(j)(q) by N_(f)(q,j)

a mesh at the next higher subdivision level “j+1” is constructed as follows. In the face point generation iteration, the face points are generated and located at positions c^(j+1)(m_(i)) determined as follows

$\begin{matrix} {{{c^{j + 1}\left( m_{i} \right)} = {\frac{1}{4}\left( {{c^{j}(q)} + {c^{j}\left( l_{i} \right)} + {c^{j}\left( l_{i + 1} \right)} + {c^{j}\left( r_{i} \right)}} \right)}},{m_{i} \in {N_{f}\left( {q,{j + 1}} \right)}},l_{i},{l_{i + 1} \in {N_{e}\left( {q,j} \right)}},{r_{i} \in {{N_{f}\left( {q,j} \right)}.}}} & (7) \end{matrix}$ In the edge point generation iteration, the edge points are generated and located at positions c^(j+1)(1 _(i)) determined as follows:

$\begin{matrix} {{{c^{j + 1}\left( l_{i} \right)} = {\frac{1}{4}\left( {{c^{j}(q)} + {c^{j}\left( k_{i} \right)} + {c^{j + 1}\left( m_{i - 1} \right)} + {c^{j + 1}\left( m_{i} \right)}} \right)}},{l_{i} \in {N_{e}\left( {q,{j + 1}} \right)}},{k_{i} \in {N_{e}\left( {q,j} \right)}},m_{i - 1},{m_{i} \in {N_{f}\left( {q,{j + 1}} \right)}}} & (8) \end{matrix}$ In the vertex point generation iteration, the new vertex points are generated and located at positions as follows:

$\begin{matrix} {{{c^{j + 1}(q)} = {{{\frac{K - 2}{K}{c^{j}(q)}} + {\frac{1}{K^{2}}{\sum\limits_{i = 0}^{K - 1}{c^{j}\left( l_{i} \right)}}} + {\frac{1}{K^{2}}{\sum\limits_{i = 0}^{K - 1}{{c^{j + 1}\left( m_{i} \right)}\mspace{11mu} l_{i}}}}} \in {N_{e}\left( {{j + 1},q} \right)}}}\;,{m_{i} \in {{N_{f}\left( {{j + 1},q} \right)}.}}} & (9) \end{matrix}$ In terms of only points c^(j), that is substituting for the last tern in equation (9),

$\begin{matrix} {{c^{j + 1}(q)} = {{\left( {1 - \frac{7}{4K}} \right){c^{j}(q)}} + {\frac{3}{2}\frac{1}{K^{2}}{\sum\limits_{l \in {N_{e}{({q,j})}}}{c^{j}(l)}}} + {\frac{1}{4K^{2}}{\sum\limits_{m \in {N_{f}{({q,j})}}}{{c^{j}(m)}.}}}}} & (10) \end{matrix}$

Generally, for quadrilateral meshes, the arrangement makes use of the Catmull-Clark methodology, except for the case of K=3 in equation (9). In that case, the arrangement makes use of

$\begin{matrix} {{{c^{j + 1}(q)} = {{\left( {1 - {8\gamma}} \right){c^{j}(q)}} + {4\gamma\;\frac{1}{K}{\sum\limits_{l \in {N_{e}{({q,j})}}}{c^{j}(l)}}} + {4\gamma\;\frac{1}{K}{\sum\limits_{m \in {N_{f}{({q,{j + 1}})}}}{c^{j + 1}(m)}}}}},} & (11) \end{matrix}$ where

$\gamma = {\frac{3}{38}.}$ Equation (11) would correspond to the Catmull-Clark methodology (equation (9)) with

${\gamma = \frac{1}{4\; K}},$ except that, for K=3,

$\gamma = \frac{3}{38}$ instead of 1/12. In terms of only points c^(j) (compare equation (10))

$\begin{matrix} {{c^{j + 1}(q)} = {{\left( {1 - {7\;\gamma}} \right){c^{j}(q)}} + {6\;\gamma\;\frac{1}{K}{\sum\limits_{l \in {N_{e}{({q,j})}}}{c^{j}(l)}}} + {\gamma\;\frac{1}{K}{\sum\limits_{m \in {N_{f}{({q,j})}}}{{c^{j}(m)}.}}}}} & (12) \end{matrix}$ These equations can be summarized by a single equation defining a subdivision rule using the subdivision matrix S_(Q,K) (where index “Q” refers to “Quadrilateral”) as follows: c ^(j+1) =S _(Q,K) c ^(j)  (13), which may be written component-wise as

$\begin{matrix} {{\left( c^{j + 1} \right)_{l} = {\sum\limits_{m}{\left( S_{Q,K} \right)\left( c^{j} \right)_{m}}}},{where}} & (14) \\ {\left( S_{Q,K} \right)_{l,m} = \left\{ \begin{matrix} {1 - \frac{7}{4\; K}} & {{{{if}\mspace{14mu} l} = 0},{m = 0}} \\ {\frac{3}{2}\frac{1}{K^{2}}} & {{{{if}\mspace{14mu} l} = 0},{m = 1},\ldots\mspace{11mu},K} \\ \frac{1}{K^{2}} & {{{{if}\mspace{14mu} l} = 0},{m = {K + 1}},\ldots\mspace{11mu},{2\; K}} \\ \frac{3}{8} & {{{{if}\mspace{14mu} l} = 1},\ldots\mspace{11mu},K,{m = {0\mspace{14mu}{or}\mspace{14mu} l}}} \\ \frac{1}{16} & {{{{if}\mspace{14mu} l} = 1},{m = K}} \\ \; & {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{11mu},K,{m = {l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = 1},\ldots\mspace{11mu},{K - 1},{m = {l + 1}}} \\ \; & {{{{or}\mspace{14mu} l} = K},{m = 1}} \\ \; & {{{{or}\mspace{14mu} l} = 1},{m = {2\; K}}} \\ \; & {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{11mu},K,{m = {K + l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = 1},\ldots\mspace{11mu},K,{m = {K + 1}}} \\ \frac{1}{4} & {{{{if}\mspace{14mu} l} = {K + 1}},\ldots\mspace{11mu},{2\; K},} \\ \; & {{m = 0},{l - K},{l - K + 1},{{or}\mspace{14mu} l}} \\ \; & {{{{or}\mspace{14mu} l} = {2\; K}},{m = 0},K,{1\mspace{14mu}{or}\mspace{14mu} 2\; K}} \\ 0 & {{otherwise},} \end{matrix} \right.} & (15) \end{matrix}$ where indices “l” and “m” range from “zero” to, and including, “2K.”

As is apparent from the above discussion, the Catmull-Clark surface subdivision methodology applied to a quadrilateral mesh at one “j-th” subdivision level will produce a quadrilateral mesh at the next higher “j+1-st” subdivision level having the same number of points as the mesh at the “j-th” subdivision level, but the points in the higher (“j+1”) subdivision level may be at different positions than in the “j-th” level. Equations (7) through (12), or equivalently equations (13) through (15), are applied by selecting each point in the mesh at subdivision level “j” as a vertex, to provide points for the mesh at subdivision level “j+1.” The Catmull-Clark surface subdivision methodology can be applied recursively to provide a mesh at any desired subdivision level.

Sharp creases in a subdivision surface maybe generated by local modifications of the surface subdivision equations described above (equations (6) through (8) in the case of a triangular mesh, equations (13) through (15) in the case of a quadrilateral mesh). This will be illustrated in connection with FIG. 6, which depicts a stencil that is useful in understanding the ordering of the index “k” for the points on opposing sides of a respective vertex v_(q) (vertex v_(q)=v_(q)(0)) through which a crease is to occur. By marking the edges of the mesh at which a crease is to occur, chains of edges can be defined that will define the position of a crease on a subdivision surface. As in the cases of both triangular and quadrilateral meshes, the positions c^(j+1) of vertices and points in the higher “j+1-st” subdivision level can be determined from positions of vertices and points c^(j) in the “j-th” level using a defining a subdivision rule comprising a subdivision matrix S_(C) (where index “C” refers to “crease”) as follows: c ^(j+1) =S _(C) c ^(j)  (16), which may be written component-wise as

$\begin{matrix} {{\left( c^{j + 1} \right)_{l} = {\sum\limits_{m}{\left( S_{C} \right)_{l,m}\left( c^{j} \right)_{m}}}},{where}} & (17) \\ {\left( S_{C} \right)_{l,m} = \left\{ \begin{matrix} \frac{3}{4} & {{{{if}\mspace{14mu} l} = 0},{m = 0}} \\ \frac{1}{8} & {{{{if}\mspace{14mu} l} = 0},{m = {1\mspace{14mu}{or}\mspace{14mu} 2}}} \\ \frac{1}{2} & {{{{if}\mspace{14mu} l} = {1\mspace{14mu}{or}\mspace{14mu} 2}},{m = {0\mspace{14mu}{or}\mspace{14mu} l}}} \\ 0 & {{otherwise},} \end{matrix} \right.} & (18) \end{matrix}$ where indices “l” and “m” range from “zero” to, and including, “two.” This subdivision rule can be used for creases in the cases subdivision surfaces defined by both triangular meshes and quadrilateral meshes.

The invention provides a system and method for generating smooth feature lines in subdivision surfaces. As with a sharp crease, a smooth feature line is defined by marking a series of edges at a given subdivision level, which edges are to define the feature line. The lowest subdivision level at which the edges that are associated with a smooth feature line are marked will be referred to as the definition level “j_(D)” for the smooth feature line In addition, a sharpness parameter will be associated with each marked edge in the definition level j_(D) for the smooth feature line. In one embodiment, the value of the sharpness parameter is in the form of a real number in the interval [0,1], that is, in the interval between “zero” and “one,” inclusive of the endpoints. If an edge has a sharpness parameter with the value “zero,” there is no crease along the edge. On the other hand, if an edge has a sharpness parameter with the value “one,” the edge forms part of a sharp crease as described above.

Generally, a smooth feature is obtained by using a subdivision rule that generalizes the subdivision rules described above (reference equations (4) through (6) in the case of a triangular mesh and equations (13) through (15) in the case of a quadrilateral mesh). The subdivision rule makes use of two parameters s₁ and s₂ which are the respective values of the sharpness parameter on two sides of a vertex across which a smooth feature line is to be generated. A subdivision surface's limit surface, that is, the surface defined by the subdivision surface's limit points, is smooth in the neighborhood of a smooth feature line. That is, for each point on the limit surface that is associated with a smooth feature line, that is, for each point for which the values of the sharpness parameters on respective sides of the point are other than “one,” the orientation of the vector that is normal to the limit surface will vary continuously. However, for the limit surface at a point for which the sharpness parameter have the value is “one,” which will be the case at a sharp crease, the normal vector will not be defined, since the orientation of the normal vector on respective sides of the point will differ.

Operations performed by the computer graphics system 10 in connection with generating a smooth feature line will be described in connection with FIGS. 7 through 10, in the case of a subdivision surface defined by a triangular mesh, and in connection with FIGS. 11 through 14, in the case of a subdivision surface defined by a quadrilateral mesh. In both cases, the smooth feature line will be defined by the positions of limit points, as well as the normal vectors at the respective limit point, in a region of a subdivision surface that is proximate the line corresponding to the edges that have been marked. As noted above, the normal vectors correspond to the cross product of two tangent vectors at the respective limit point, namely, a tangent vector along the smooth feature line at the respective limit point and a tangent vector across the smooth feature line at the respective limit point.

With reference to FIG. 7, that FIG. depicts a portion of a subdivision surface defined by a triangular mesh with vertex v_(q) (vertex v_(q)=v_(q)(0)) and points v_(q)(1) through v_(q)(K) with indices numbered as depicted in the FIG. The vertices are labeled such that a crease, which is to define part of a smooth feature line, passes through point v_(q)(1), vertex v_(q) and point v_(q)(L+1) along edges v_(q)(1),v_(q) (which will be referred to as edge (1,0)) and v_(q),v_(q)(L+1) (which will be referred to as edge (0,L+1)). The value of the sharpness parameter associated with the edge (1,0) will be referred to as s₁ and the value of the sharpness parameter associated with the edge (0,L+1) will be referred to as s₂. Since edges (1,0) and (0,L+1) have been indicated as being edges that define a crease, the value of the sharpness parameter will be non-zero. The values of the sharpness parameters associated with the other edges that are on the vertex v_(q) may be“zero,” or non-zero. Generally the subdivision rule described in equation (4) (or, equivalently, equation (5)) can be used to determine the positions of respective vertices, using the subdivision matrix

$\begin{matrix} \begin{matrix} {\left( {S_{{sc},T,K,L}\left( {s_{1},s_{2}} \right)} \right)_{l,m} =} \\ \left\{ \begin{matrix} {{\left( {1 - s_{3}} \right)\left( {1 - {a(K)}} \right)} + {\frac{3}{4}s_{3}}} & {{{{if}\mspace{14mu} l} = 0},{m = 0}} \\ {{\left( {1 - s_{3}} \right)\frac{a(K)}{K}} + {\frac{1}{8}s_{3}}} & {{{{if}\mspace{14mu} l} = 0},{m = {{1\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\left( {1 - s_{3}} \right)\frac{a(K)}{K}} & {{{{if}\mspace{14mu} l} = 0},{m = 2},\ldots\mspace{11mu},L} \\ \; & {{{{or}\mspace{14mu} l} = 0},{m = {L + 2}},\ldots\mspace{11mu},K} \\ {\frac{3}{8} + {\frac{1}{8}s_{2}}} & {{{{if}\mspace{14mu} l} = 1},{m = {0\mspace{14mu}{or}\mspace{14mu} 1}}} \\ {\frac{3}{8} + {\frac{1}{8}s_{1}}} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = {{0\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\frac{1}{8}\left( {1 - s_{2}} \right)} & {{{{if}\mspace{14mu} l} = 1},{m = {2\mspace{14mu}{or}\mspace{14mu} K}}} \\ {\frac{1}{8}\left( {1 - s_{1}} \right)} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = {{L\mspace{14mu}{or}\mspace{14mu} L} + 2}}} \\ \frac{3}{8} & {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{11mu},L,{m = 0}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{11mu},K,{m = 0}} \\ \; & {{{{or}\mspace{14mu} l} = {m = 2}},\ldots\mspace{11mu},L} \\ \; & {{{{or}\mspace{14mu} l} = {m = {L + 2}}},\ldots\mspace{11mu},K} \\ \frac{1}{8} & {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{11mu},L,{m = {l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{11mu},K,{m = {l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{11mu},L,{m = {l + 1}}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{11mu},K,{m = {l + 1}}} \\ \; & {{{{or}\mspace{14mu} l} = K},{m = 1}} \\ 0 & {{otherwise},} \end{matrix} \right. \end{matrix} & (19) \end{matrix}$ where, as in equation (6), indices “l” and “m” range from “zero” to, and including, “K,” and where

${s_{3} = {\frac{1}{2}\left( {s_{1} + s_{2}} \right)}},$ the average of the values of the parameters s₁ and s₂ associated with the edges (1,0) and (0,L+1).

To ensure that the directions of the tangent vectors vary continuously at and near irregular vertices, the value(s) of the sharpness parameter(s) are gradually reduced as the level of the mesh increases. In the case of smooth feature lines, the repeated update of the value of the sharpness parameter as the level of the mesh increases would provide a value that approaches zero, which, in turn, will provide that the directions of the tangent vectors vary continuously at the limit surface. In one embodiment, for a vertex v_(q) for which the sharpness parameters s₁ and s₂ have the same value “s” on both sides of the vertex (that is, s₁=s₂), the sharpness parameter update function is s(j+1)=(s(j))²  (20), that is, s(j+1), the value of the sharpness parameters s₁ and s₂ at the higher “j+1-st” subdivision level mesh, is the square of s(j), the value of the sharpness parameters s₁ and s₂ at the lower (“j-the”) level mesh. On the other hand, for a vertex v_(q) for which values of sharpness parameters s₁ and s₂ are not constant across the vertex (that is, s₁≠s₂), the sharpness parameter update functions are a function of the values of both sharpness parameters s₁ and s₂. In one embodiment, the function is selected to be

$\begin{matrix} {{{s_{1}\left( {j + 1} \right)} = \left( {{\frac{3}{4}{s_{1}(j)}} + {\frac{1}{4}{s_{2}(j)}}} \right)^{2}},{and}} & (21) \\ {{{s_{2}\left( {j + 1} \right)} = \left( {{\frac{1}{4}{s_{1}(j)}} + {\frac{3}{4}{s_{2}(j)}}} \right)^{2}},} & (22) \end{matrix}$ essentially providing a linear combination corresponding to quadratic splines.

Since the values of the sharpness parameters s₁ and s₂ vary from level to level, the smooth curve subdivision matrix (S_(sc,T,K,L)(s₁,s₂))_(lm) (equation (19)) will also not be constant from level to level. Accordingly eigen-analysis, which is conventionally used to determine positions of limit points and orientations of tangent vectors for subdivision surfaces, is not used here. As suggested above, a subdivision surface is defined by a collection limit points and normal vectors (or, equivalently, two tangent vectors for each normal vector), which, in turn, are provided by iteratively applying equation (4) from a definition level “j_(D)” for the mesh to the level j=∞. The definition level j_(D) is the lowest subdivision level “j” for which the respective smooth feature line is defined in the subdivision surface. Accordingly, in order to determine the positions of the limit points, the infinite subdivision matrix

$\begin{matrix} {{{S_{{sc},T,K,L,{LP}}\left( {s_{1},s_{2}} \right)} = {\prod\limits_{j = \infty}^{j_{D}}\;{S_{{sc},T,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}}},} & (23) \end{matrix}$ is evaluated, where S_(sc,T,K,L)(s₁(j),s₂(j)) is the subdivision matrix described above in connection with equation (19) for sharpness parameters corresponding to the “j-th” level in the matrix product on the right-hand side of equation (23). For S_(sc,T,K,L,LP)(s₁,s₂) on the left-hand side of equation (23), arguments s₁ and s₂ refer to the sharpness parameters at the definition level of the smooth feature line, that is, s₁=s₁(j_(D)) and s₂=s₂(j_(D)), and the subscript “LP” refers to “Limit Point.” Since matrix multiplication is not commutative, the order of the factors in the matrix product in equation (23) is important. In equation (23), the order of the factors from left to right in the product extends from j=∞ on the left to j=j_(D) on the right, as suggested by equation (4).

The matrix product (equation (23)), converges to a “K+1”-by-“K+1” matrix that has “K+1” rows, with the components comprising each row being identical to the components of the other rows, in the same order. A vector of weight values l_(LP) for determining the position σ(q) of the limit point is obtained as follows: l _(LP)(s ₁ ,s ₂)=ν _(LP) ·S _(sc,T,K,L,LP)(s ₁ ,s ₂)  (24), where vector v_(LP) is a vector of weights that are used in determining the position of a limit point of a subdivision surface using the Loop subdivision methodology in the absence of a smooth feature line, that is,

$\begin{matrix} {{v_{LP} = \left( {\frac{\omega(K)}{{\overset{\sim}{\omega}(K)} + K},\frac{1}{{\overset{\sim}{\omega}(K)} + K},\frac{1}{{\overset{\sim}{\omega}(K)} + K},\ldots\mspace{11mu},\frac{1}{{\overset{\sim}{\omega}(K)} + K}} \right)},{where}} & (25) \\ {{{\overset{\sim}{\omega}(K)} = \frac{3\; K}{8\;{a(K)}}},} & (26) \end{matrix}$ where a(K) is as defined in equation (3). The position σ(q) of a limit point associated with a vertex v_(q)(0) is computed from the position c^(j) ^(D) (q) of the vertex v_(q)(0) and the positions c^(j) ^(D) (k), k=1, . . . , K, of the neighboring points v_(q)(k) around the vertex v_(q)(0), in the mesh corresponding to the definition level j_(D) of the smooth feature line in the subdivision surface, or to any subdivision level higher than the definition level, using the components of l_(LP) as weight values. The components of limit point weight vector l_(LP)(s₁,s₂) can be satisfactorily approximated by second degree polynomials in s₁ and s₂ using six values per component and per valence.

If

${L = \frac{K}{2}},$ symmetry considerations allow the number of values per component to be reduced. In that case, the components of limit point weight vector l_(LP) satisfy the following symmetry relations:

-   -   1. The “i-th” component of limit point weight vector l_(LP)         equals the “K+2-i-th” component of l_(LP), that is,         (l_(LP))_(i)=(l_(LP))_(K+2−i), for

${i = {\frac{K}{2} + 2}},{\ldots\mspace{14mu}{K.}}$ This is a result of the fact that the subdivision matrix (equation (19) is invariant upon reflection with respect to the crease line. As a result, approximations need only be generated for components

${i = 0},1,\ldots\mspace{14mu},{\frac{K}{2} + 1.}$

-   -   2. Further, since the subdivision matrix (equation (19)) is also         symmetric in s₁ and s₂,

${\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{i} = \left( {l_{LP}\left( {s_{2},s_{1}} \right)} \right)_{\frac{K}{2} + 2 - i}},$ and so approximations need only be generated for

${i = 0},1,\ldots\mspace{11mu},\left\lfloor {\frac{K}{4} + 1} \right\rfloor,$ where

${''\left\lfloor \frac{x}{y} \right\rfloor''}\;$ refers to the greatest integer in the quotient “x/y;”

-   -   3. Further, since, if the particular values of the parameters s₁         and s₂ were interchanged, the vertex v_(q) would behave in the         same way, (l_(LP)(s₁,s₂))₀=(l_(LP)(s₂,s₁))₀, and         -   so the approximation may be constructed using only             symmetric, second-degree polynomials in s₁ and s₂, that is,             using four coefficients; and     -   4. Further, if “K” is a multiple of “four,” then, from         points (1) and (2) above,

$\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{\frac{K}{4} + 1} = {\left( {l_{LP}\left( {s_{2},s_{1}} \right)} \right)_{\frac{K}{4} + 1}.}$ Accordingly, these components can be approximated using symmetric second-degree polynomials using four coefficients.

In one embodiment, regardless of whether

${L = \frac{K}{2}},$ the approximating polynomials are computed using a least-squares Chebyshev approximation methodology. The matrix product (equation (23)) is evaluated at the points of a grid in the (s₁,s₂) region made up of roots of Chebyshev polynomials

$\begin{matrix} {{\left( {s_{1},s_{2}} \right) = \left( {{\cos\left( \frac{\left( {i + \frac{1}{2}} \right)\pi}{N} \right)},{\cos\left( \;\frac{\left( {j + \frac{1}{2}} \right)\pi}{N} \right)}} \right)},} & (27) \end{matrix}$ for i,j=0, . . . N−1. In one embodiment, “N” is taken to be “eight,” so that there are “sixty-four” sample points in equation (27). The coefficients b_(ij) (j=0, . . . , 3 in the symmetric case, or j=0, . . . , 5 in the asymmetric case) for the polynomial (l _(LP))_(i) ≈b _(i0) +b _(i1)(s ₁ +s ₂)+b _(i2)(s₁ ² +s ₂ ²)+b _(i3) s ₁s₂  (28), in the symmetric case

$\left( {i = {{0\mspace{14mu}{or}\frac{K}{4}} + 1}} \right),$ or the polynomial (l _(Lp))_(i) ≈b _(i0) +b _(i1) s ₁ +b _(i2) s ₂ +b _(i3) s ₁ ² +b _(i4) s ₂ ² +b _(i5) s ₁ s ₂  (29), in the asymmetric case (“i” otherwise), are determined by a least squares methodology. In that operation, the computer graphics system 10 computes the matrix product (equation (23) evaluated at points (s₁,s₂) as defined in equation (27)). Thereafter, a set of N² polynomials (equation (28) and/or (29)) are generated using the values of s₁ and s₂ at the respective points (equation (27)) in the (s₁,s₂) region, with each polynomial being equal to the respective “i-th” component of the row of the matrix product. The computer graphics system 10 then determines the values of the coefficients b_(ij) in the polynomials using the least squares approximation methodology. After the values of the coefficients b_(ij) have been determined, they are used to generate the values of the components (l_(LP))_(i) of limit point weight vector l_(LP) using equations (28) and (29).

The error in the least squares approximation has an oscillatory behavior over the region (s₁,s₂) and will be minimized if the amplitude of the oscillations is distributed evenly over the region. This can be accomplished by relaxing the constraints imposed by a weighted least squares methodology for points that are well-approximated and tightening the constraints for the points that are poorly approximated. In the weighted least squares methodology, after the values of the coefficients b_(ij) have been evaluated using the least squares methodology described above, the polynomial (equation (28) and/or (29)) is evaluated at each point in the (s₁,s₂) region, the value compared to the value generated for the respective component of the matrix product (equation (23)), and a weight value determined that reflects the difference therebetween. Thereafter, the weight values can be used in constraining the approximations of the values of the coefficients b_(ij) in an uneven manner.

FIG. 8 depicts a table of coefficients b_(ij) for K=4, 6, . . . , 16, with the indexing, in the form of the C programming language,

${{{b\left\lbrack {\frac{K}{2} - 2} \right\rbrack}\lbrack i\rbrack}\lbrack j\rbrack},$ where “i” is the index of the component of limit point weight vector l_(LP), taking values in the range

${i = 0},\ldots\mspace{14mu},\left\lfloor {\frac{K}{4} + 1} \right\rfloor,$ and “j” is the index of the coefficient b_(ij) of the approximating polynomial.

After the limit point weight vector l_(LP) associated with a vertex v_(q)(0) has been generated as described above, it can be used along with the position c^(j)(q) of the vertex v_(q)(0) and positions c^(j)(k) of the points v_(q)(k), k=1, . . . , K neighboring the vertex v_(q)(0) to determine the position σ(q) of the limit point associated with the vertex v_(q)(0) as follows

$\begin{matrix} {{{\sigma(q)} = {\sum\limits_{i = 0}^{K}{\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{i}{c^{j}(i)}}}},} & (30) \end{matrix}$ where, as suggested above, i∈q∪N(q,j) (reference FIG. 7), and where (l_(LP)(s₁,s₂))_(i) refers to the “i-th” component of l_(LP)(s₁,s₂), which, in turn, corresponds to the limit point weight vector l_(LP) for sharpness parameter values s₁ and s₂ at the definition level j=J_(D) for the smooth feature line or at any subdivision level higher than the definition level j_(D), and indices 0, . . . , K are as shown in FIG. 7.

One embodiment makes use of a similar polynomial approximation methodology to obtain good approximations for vectors l_(C) and l_(S) of weight values that are to be used in generating the tangent vectors, tangent vector weight vector l_(C) being used in generating the tangent vector along the smooth feature line and tangent vector weight vector l_(S) being used in generating the tangent vector across the smooth feature line at the limit point associated with the vertex v_(q)(0) with which the respective tangent vector weight vectors is associated. In that methodology, a vector l_(C)(J) is generated as follows:

$\begin{matrix} {{{l_{C}(J)} = {\left( {0,1,0,\ldots\mspace{14mu},{- 1},0,\ldots} \right) \cdot {\prod\limits_{j = J}^{J_{D}}{S_{{sc},T,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}}}},} & (31) \end{matrix}$ where the two non-zero components of the row vector on the right hand side are a “one” at position “one” in the row vector, and a “negative one” at position

${\frac{K}{2} + 1},$ and “.” refers to the dot product.

After generating vector l_(C)(J) according to equation (31), the value is normalized and the limit taken as J→∞:

$\begin{matrix} {{l_{C} = {\lim\limits_{j\rightarrow\infty}\frac{l_{C}(J)}{{l_{C}(J)}}}},} & (32) \end{matrix}$ where

${{v} = \sqrt{\sum\limits_{i}v_{i}^{2}}},$ that is, the Euclidean norm. The components of vector l_(C) (equation (32)) form a sequence of weight values that are used in multiplying the respective positions of the vertex v_(q)(0) and the points v_(q)(k), k=1, . . . , K, around the vertex v_(q)(0), as shown in FIG. 7, the sum of which defines the tangent vector along the smooth feature line at the point on the subdivision surface associated with the vertex v_(q)(0).

As with the components of limit point weight vector l_(LP), the components of tangent vector weight vector l_(C) can be approximated by polynomials in s₁ and s₂, in this case third degree polynomials. Accordingly, the approximations of the components of tangent vector weight vector l_(C) can be efficiently generated by using up to ten numbers per component and per valence. If

${L = \frac{K}{2}},$ symmetry considerations allow the number of polynomial coefficients that are used in generating components of tangent vector weight vector l_(C) to be reduced. In that case, the components of tangent vector weight vector l_(C) satisfy the following symmetry relations:

-   -   1. The “i-th” component and the “k+2-i-th” component of tangent         vector weight vector l_(C) are equal, that is,         (l_(C))=(l_(C))_(K+2-i), for

${i = {\frac{K}{2} + 2}},\ldots\mspace{11mu},{K.}$ This is a result of the invariance of the subdivision matrix (equation (19)) upon reflection with respect to the crease line. As a result, approximations need only be generated for components

${i = 0},1,\ldots\mspace{14mu},{{\frac{K}{2} + 1};}$

-   -   2. Further, since

${\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{i} = {- \left( {l_{C}\left( {s_{2},s_{1}} \right)} \right)_{\frac{K}{2} + 2 - i}}},$ approximations need only be generated for components

${i = 0},1,\ldots\mspace{14mu},{\left\lfloor {\frac{K}{4} + 1} \right\rfloor;}$

-   -   3. Further, since, if the particular values of the parameters s₁         and s₂ were interchanged, the vertex v_(q) would behave in the         same manner except that the orientation of the tangent vector         would be reversed, (l_(C)(s₁,s₂))₀=−(l_(C)(s₂,s₁))₀, in which         case the approximation may be constructed using only         anti-symmetric, third-degree polynomials in s₁ and s₂, using         four coefficients; and     -   4. Further, if K is a multiple of“four,” then, from points (1)         and (2) immediately above,

$\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{\frac{K}{4} + 1} = {- {\left( {l_{C}\left( {s_{2},s_{1}} \right)} \right)_{\frac{K}{4} + 1}.}}$ Accordingly, these components can be approximated using anti-symmetric polynomials using four coefficients.

In one embodiment, the approximating polynomials are also computed using a least squares Chebyshev approximation methodology similar to that used in connection with the limit point approximation described above. The matrix product of equation (31) is evaluated at points of a grid in the (s₁, s₂) region made up of roots of Chebyshev polynomials (equation (27)). The coefficients b_(ij)(j=0, . . . , 3, in the anti-symmetric case, or j=0, . . . , 9, in the non-symmetric case) for the polynomial (l _(C))_(i) =b _(i0)(s ₁ −s ₂)+b _(i1)(s ₁ ² −s ₂ ²)+b _(i2)(s ₁ ³ −s ₂ ³)+b _(i3)(s ₁ ² s ₂ −s ₁ s ₂ ²)  (33), in the anti-symmetric case

$\left( {i = {{0\mspace{14mu}{or}\mspace{14mu}\frac{K}{4}} + 1}} \right),$ or the polynomial (l _(c))_(i) =b _(i0) +b _(i1) s ₁ +b _(i2) s ₂ +b _(i3) s ₁ ² +b _(i4) s ₁ s ₂ +b _(i5) s ₂ ² +b _(i6) s ₁ ³ +b _(i7) s ₁ ² s ₂ +b _(i8) s ₁ s ₂ ² +b _(i9) s ₂ ³  (34), in the non-symmetric case (“i” otherwise), are determined using the least squares methodology as described above.

In a manner similar to the generation of the tangent vector along the smooth feature line (reference equations (31) through (34) above), a vector l_(S) of weight values is used in generating the tangent vector across the smooth feature line. The components of tangent vector weight vector l_(S) comprise a sequence of weight values that are used to multiply the positions of the vertex v_(q)(0) and points v_(q)(1) through v_(q)(K) around vertex v_(q)(0) (reference FIG. 7), the sum of which comprises the tangent vector across the smooth feature line. In that methodology, a vector l_(S)(J) is generated as follows:

$\begin{matrix} {{l_{S}(J)} = {\left( {0,{\sin\;\frac{2{\pi(0)}}{K}},{\sin\;\frac{2\pi(1)}{K}},\ldots\mspace{14mu},{\sin\frac{\;{2{\pi\left( {K - 1} \right)}}}{K}}} \right) \cdot {\prod\limits_{j = J}^{J_{D}}{{S_{{sc},T,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}.}}}} & (35) \end{matrix}$

Vector l_(S)(J) is normalized and the limit taken as J→∞, in the same manner as described above in connection with equation (32), to provide tangent vector weight vector l_(S).

When

${L = \frac{K}{2}},$ tangent vector weight vector l_(S) is

$\begin{matrix} {{l_{S} = \left( {0,{\sin\;\frac{2\pi(0)}{K}},{\sin\;\frac{2\pi(1)}{K}},\ldots\;,\;{\sin\;\frac{2\pi\left( {K - 1} \right)}{K}}} \right)},} & (36) \end{matrix}$ which is the same as in a the case of a smooth feature line associated with a sharpness parameter of zero.

The components of tangent vector weight vector l_(S) can be approximated as l_(S)(s₁,s₂) using third degree polynomials in sharpness parameters s₁ and s₂. The operations performed in generating the coefficients for the polynomials correspond to the operations performed in generating the coefficients for the polynomials described above for the tangent vector weight vector l_(C) used in generating the tangent vector along the smooth feature line (equations (31) through (34)).

FIG. 9 depicts a table of coefficients b_(ij) for K=4, 6, . . . , 12, with the indexing, in the form of the C programming language,

${{{b\left\lbrack {\frac{K}{2} - 2} \right\rbrack}\lbrack i\rbrack}\lbrack j\rbrack},$ where “i” is the index of the component of l_(C), taking values in the range

${i = 0},\ldots\mspace{14mu},\left\lfloor {\frac{K}{4} + 1} \right\rfloor,$ and “j” is the index of the coefficient b_(ij) of the approximating polynomial.

As noted above, the tangent vector weight vectors l_(C)(=l_(C)(s₁,s₂)) and l_(S)(=l_(S)(s₁,s₂)) (where s₁ and s₂ are the sharpness parameter values at the definition level j=j_(D) for the smooth feature line) are used, along with the position c^(j)(q) of the vertex v_(q)(0) and the positions c^(j)(k) of the neighboring points v_(q)(k), k=1, . . . , K. In particular, the components of the respective tangent vector weight vectors are used to weight the positions of the vertex and neighboring points, with the sum comprising the tangent vector. That is, the tangent vector e_(C)(q) along the smooth feature line and the tangent vector e_(S)(q) across the smooth feature line are generated as

$\begin{matrix} {{{e_{C}(q)} = {\sum\limits_{i = 0}^{K}{\left( {l_{c}\left( {s_{1},s_{2}} \right)} \right)_{i}{c^{j}(i)}}}}{{{e_{S}(q)} = {\sum\limits_{i = 0}^{K}{\left( {l_{S}\left( {s_{1},s_{2}} \right)} \right)_{i}{c^{j}(i)}}}},}} & (37) \end{matrix}$ where l_(C)(s₁,s₂)=l_(C) and l_(S)(s₁s₂)=l_(S) (where s₁ and s₂ are the sharpness parameter values at the definition level j=j_(D) for the smooth feature line), and indices 0, . . . , K are as shown in FIG. 7.

In some circumstances, it is impractical to use polynomials to generate approximations for limit point weight vector l_(LP) and tangent vector weight vectors l_(C) and l_(S). For example, if the number of configurations of smooth feature lines, each requiring a different set of polynomials, exceeds some number, the number of polynomials would increase to an extent that it would be impractical to use that methodology. An alternative methodology makes use of extrapolation to generate approximations for limit point weight vector l_(LP) and tangent vector weight vectors l_(C) and l_(S).

The extrapolation methodology for generating an approximation of limit point weight vector l_(LP)(s₁,s₂) starts with the first few factors of equation (23) for finite values of index “j.” In the following, it will be assumed that the definition level j_(D) for the smooth feature line is level “zero,” although it will be appreciated that this will not restrict the generality of the description. The matrix product generated by taking factors j=J,J−1, . . . , 0 is given by

$\begin{matrix} {{{{S_{{sc},T,K,L,{LP}}(J)}\left( {s_{1},s_{2}} \right)\text{:}} = {\prod\limits_{j = J}^{0}{S_{{sc},T,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}}},} & (38) \\ {with} & \; \\ {{{{S_{{sc},T,K,L,{LP}}(0)}\left( {s_{1},s_{2}} \right)\text{:}} = I_{K + 1}},} & (39) \end{matrix}$ where, for the limit case J=0 (in which case there would be no factors in generating the product matrix), the product matrix S_(sc,T,K,L,LP)(0)(s₁,s₂) is the identity matrix of size “K+1” by “K+1.” A vector of weight values l_(LP) for determining the position σ(q) of the limit point is obtained as follows: l _(LP)(J)(s ₁ ,s ₂)=v _(LP) ·S _(sc,T,K,L,LP)(J)(s ₁,s₂)  (40), where v_(LP) is as defined above in connection with equations (28) and (29).

In one embodiment, a reasonably accurate approximation of limit point weight vector l_(LP) can be obtained using just the vectors corresponding to J=0,1,2,3 by using polynomial extrapolation. The convergence of l_(LP)(J)(s₁,s₂) to l_(LP)(s₁,s₂) is very rapid, with the error ∈(j)=|l_(LP)(J)−l_(LP)| approaching zero as 2⁻² ^(J) if the update rule described above in connection with equations (20) through (22) are used for the sharpness parameters. The approximation to l_(LP) is constructed by generating the third degree polynomial that interpolates the points {x=2⁻² ^(J) , y=l_(LP)(J)}, J=0, 1, 2, 3, and then evaluating this polynomial by extrapolation at the point x=0, that is

$\begin{matrix} {{l_{LP} \approx {\sum\limits_{J = 0}^{3}{b_{J}{l_{LP}(J)}}}},} & (41) \end{matrix}$ where l_(LP)(J) is as defined in equation (40) and where the coefficients b_(j) are given by

$\begin{matrix} {{b_{0} = \frac{- 135}{120015}}{b_{1} = \frac{1270}{120015}}{b_{2} = \frac{- 12192}{120015}}{b_{3} = {\frac{131072}{120015}.}}} & (42) \end{matrix}$ This extrapolation methodology can be used for any vertex, whether the vertex is regular or irregular. In addition, the methodology can be used for any configuration of creases through the respective vertex, and any value of valence “K” for the respective vertex.

An extrapolation methodology can also be used to generate the tangent vector weight vectors l_(C) and l_(S). Generally, in that methodology the matrix products S_(sc,T,K,L,LP)(J)(s₁,s₂) described above (equations (38) and (39)), which are then

-   -   (1) multiplied by a vector v_(C), if tangent vector weight         vector l_(C) is being generated, or a vector v_(S), if tangent         vector weight vector l_(S) is being generated, and     -   (2) the result from (1) is thereafter multiplied by a dilation         factor that maintains the respective tangent vector weight         vector in normalized form.

The approximations of the tangent vector weight vectors l_(C) and l_(S) are generated from l _(C)(J)(s ₁ ,s ₂)=d(K)^(J) v _(C) ·S _(sc,T,K,L,LP)(J)(s ₁ ,s ₂) l _(S)(J)(s ₁ ,s ₂)=d(K)^(J) v _(S) ·S _(sc,T,K,L,LP)(J)(s ₁ ,s ₂)  (43), where d(K) represents the dilation factor. The vectors v_(C) and v_(S) are given by

$\begin{matrix} {{v_{C} = \left( {0,{\cos\;\frac{2\pi(0)}{K}},{\cos\;\frac{2\pi(1)}{K}},\ldots\mspace{14mu},{\cos\;\frac{2\pi\left( {K - 1} \right)}{K}}} \right)}{{v_{S} = \left( {0,{\sin\;\frac{2\pi(0)}{K}},{\sin\;\frac{2\pi(1)}{K}},\ldots\mspace{14mu},{\sin\;\frac{2\pi\left( {K - 1} \right)}{K}}} \right)},}} & (44) \end{matrix}$ and the dilation factor d(K) is the reciprocal of one of the eigenvalues of the subdivision matrix for the smooth case, namely,

$\begin{matrix} {{d(K)} = {\frac{1}{\frac{3}{8} + {\frac{1}{4}\cos\;\frac{2\pi}{K}}}.}} & (45) \end{matrix}$

Approximations to the tangent vector weight vectors l_(C) and l_(S) are given by

$\begin{matrix} {{l_{C} = {\sum\limits_{J = 0}^{3}{b_{J}{l_{C}(J)}}}}{{l_{S} = {\sum\limits_{J = 0}^{3}{b_{J}{l_{S}(J)}}}},}} & (46) \end{matrix}$ where the coefficients b_(J) have the form as given in equation (42). This extrapolation methodology can be used in connection with all configurations. The tangent vector generated using the weight vector l_(C) will be oriented approximately in the direction of the edge [1,0] between vertex v_(q)(0) and point v_(q)(1), and the tangent vector generated using the weight vector l_(S) will be oriented approximately perpendicular to the edge [1,0]. Although the angle between edges [1,0] and [0,L+1] for a given level “j” in a subdivision surface is typically not one hundred and eighty degrees, as the level “j” approaches infinity, the angle will approach one hundred and eighty degrees. Accordingly, in the limit, that is, as “j” approaches infinity, the tangent vector along the edge on one side of the limit point associated with a vertex v_(q)(0) will approach the opposite direction as the tangent vector along the edge on the other side of the limit point associated with the same vertex. Similarly, the tangent vector across the edge on one side of the limit point associated with the vertex v_(q)(0) will approach the opposite direction as the tangent vector across the edge on the other side of the limit point associated with the same vertex.

With this background, operations performed by the computer graphics system 10 in generating the weight vectors l_(LP), l_(C) and l_(S) useful in generating the limit point and tangent vectors for a subdivision surface for a triangular mesh will be described in connection with the flowchart depicted in FIG. 10. With reference to that FIG., the computer graphics system 10 first initializes the subdivision matrices S_(sc,T,K,L)(S₁(j),s₂(j)), j=0,1,2 (step 100) as described above in connection with equation (19). Thereafter, the computer graphics system 10 generates the matrix products S_(sc,T,K,L,LP)(J)(s₁,s₂) for J=2,3 (step 101). For J=1, S_(sc,T,K,L,LP)(1)(s₁,s₂)=S_(sc,T,K,L)(s₁,s₂), and, as indicated above, for J=0, S_(sc,T,K,L,LP)(0)(s₁,s₂) is the “K+1”-by-“K+1” identity matrix.

After the computer graphics system 10 has generated the matrix products S_(sc,T,K,L,LP), it takes the first row of each matrix product S_(sc,T,K,L,LP)(J)(s₁,s₂), J=0, 1, 2, 3, and generates component-wise an approximation to limit point weight vector l_(LP) in accordance with the extrapolation formula in equation (41) (step 102). In addition, the computer graphics system 10 uses the matrix products S_(sc,T,K,L,LP)(J)(s₁,s₂), dilation factor d(K) and vectors v_(C) and v_(S) to generate the vectors l_(C)(J) and l_(S)(J), J=1, 2, and 3 as described above in connection with equation (43) (step 103). For J=0, the respective weight vectors are l_(C)(0)=v_(C) and l_(S)(0)=v_(S). Following step 103, the computer graphics system 10 can use l_(C)(J) and l_(S)(J) to generate the approximations to the tangent vector weight vectors l_(C) and l_(S) in accordance with equation (46) (step 104). After the limit point weight vector l_(LP) and tangent vector weight vectors l_(C) and l_(S) have been generated, the limit point and tangent vectors can be generated as described above (reference equations (30) and (37), respectively), and the normal vector can also be generated as the cross product between the tangent vectors (step 105).

Operations performed by the computer graphics system 10 in connection with generating a smooth feature line in the case of a subdivision surface defined by a quadrilateral mesh will be described in connection with FIGS. 11 through 13 and the flow chart in FIG. 10. With reference to FIG. 11, that FIG. depicts a portion of a subdivision surface defined by a triangular mesh with vertex v_(q)(vertex v_(q)=v_(q)(0)) and points v_(q)(1) through v_(q)(2K) with indices numbered as depicted in the FIG. It will be appreciated that points v_(q)(1) through v_(q)(K) are first-order neighbors of vertex v_(q), and points v_(q)(K+1) through v_(q)(2K) are second-order neighbors of vertex v_(q). The vertices are labeled such that a crease passes through point v_(q)(1), vertex v_(q)(0) and point v_(q)(L+1) along edges v_(q)(1),v_(q) (which will be referred to as edge (1,0)) and v_(q),v_(q)(L+1) (which will be referred to as edge (0,L+1)). The value of the sharpness parameter associated with the edge (1,0) will be referred to as s₁ and the value of the sharpness parameter associated with the edge (0,L+1) will be referred to as s₂. Generally the subdivision rule described in equations (13) and (14) can be used to determine the positions of respective vertices, using, instead of the subdivision matrix described above in connection with equation (15), the subdivision matrix

$\begin{matrix} {\left( {S_{{sc},Q,K,L}\left( {s_{1},s_{2}} \right)} \right)_{l,m} = \left\{ \begin{matrix} {{\left( {1 - s_{3}} \right)\left( {1 - \frac{7}{4K}} \right)} + {\frac{3}{4}s_{3}}} & {{{{if}\mspace{14mu} l} = 0},{m = 0}} \\ {{\left( {1 - s_{3}} \right)\left( \frac{3}{2K^{2}} \right)} + {\frac{1}{8}s_{3}}} & {{{{if}\mspace{14mu} l} = 0},{m = {{1\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\left( {1 - s_{3}} \right)\left( \frac{3}{2K^{2}} \right)} & \begin{matrix} {{{{if}\mspace{14mu} l} = 0},{m = 2},\ldots\mspace{14mu},L} \\ {{{{or}\mspace{14mu} l} = 0},{m = {L + 2}},\ldots\mspace{14mu},K} \end{matrix} \\ {\left( {1 - s_{3}} \right)\left( \frac{1}{4K^{2}} \right)} & {{{{if}\mspace{14mu} l} = 0},{m = {K + 1}},\ldots\mspace{14mu},{2K}} \\ {{\frac{3}{8}\left( {1 - s_{2}} \right)} + {\frac{1}{2}s_{2}}} & {{{{if}\mspace{14mu} l} = 1},{m = {0\mspace{20mu}{or}\mspace{14mu} 1}}} \\ {\frac{1}{16}\left( {1 - s_{2}} \right)} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = 2},K,{K + {1\mspace{14mu}{or}\mspace{14mu} 2K}}} \\ {{\frac{3}{8}\left( {1 - s_{1}} \right)} + {\frac{1}{2}s_{1}}} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = {{0\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\frac{1}{16}\left( {1 - s_{1}} \right)} & \begin{matrix} {{{{if}\mspace{14mu} l} = {L + 1}},{m = L},{L + 2},} \\ {K + {1\mspace{14mu}{or}\mspace{14mu} K} + L + 1} \end{matrix} \\ \frac{3}{8} & \begin{matrix} \begin{matrix} \begin{matrix} {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = 0}} \\ {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = 0}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = {m = 2}},\ldots\mspace{14mu},L} \end{matrix} \\ {{{{or}\mspace{14mu} l} = {m = {L + 2}}},{\ldots\mspace{11mu} K}} \end{matrix} \\ \frac{1}{16} & \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {l - 1}}} \\ {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {l + 1}}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {K + l - 1}}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{20mu},L,{m = {K + l}}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {l - 1}}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{20mu},{K - 1},{m = {l + 1}}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = K},{m = 1}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {K + l - 1}}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {K + l}}} \end{matrix} \\ \frac{1}{4} & {\begin{matrix} \begin{matrix} {{{{if}\mspace{14mu} l} = {K + 1}},\ldots\mspace{14mu},{{2K} - 1},{m = 0},} \\ {{l - K},{l - K + {1\mspace{14mu}{or}\mspace{14mu} l}}} \end{matrix} \\ {{{{or}\mspace{14mu} l} = {2K}},{m = 0},K,{1\mspace{14mu}{or}\mspace{14mu} 2K}} \end{matrix}\mspace{11mu}} \\ 0 & {{otherwise},} \end{matrix} \right.} & (47) \end{matrix}$ is used, where, as with equation (19),

${s_{3} = {\frac{1}{2}\left( {s_{1} + s_{2}} \right)}},$ the average of the values of the parameters s₁ and s₂ associated with the edges (1,0) and (0,L+1).

As with the case of a subdivision surface defined by a triangular mesh, to ensure that the direction of the respective tangent vectors vary continuously at and near irregular vertices at the various subdivision levels, the value(s) of the sharpness parameter(s) are gradually reduced as the subdivision level of the mesh increases. In one embodiment, the computer graphics system varies the value(s) of the sharpness parameter(s) in the case of a subdivision surface defined by a quadrilateral mesh in the same manner as in the case of a subdivision surface defined by a triangular mesh (reference equations (20) through (22) above).

As with the case of a subdivision surface defined by a triangular mesh, to determine the positions of the limit point associated with a vertex v_(q)(0) in the case of a subdivision surface defined by a quadrilateral mesh, the infinite subdivision matrix product

$\begin{matrix} {{S_{{sc},Q,K,L,{LP}}\left( {s_{1},s_{2}} \right)} = {\prod\limits_{j = \infty}^{J_{D}}{S_{{sc},Q,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}}} & (48) \end{matrix}$ is evaluated, where S_(sc,Q,K,L)(S₁(j),s₂(j)) is the subdivision matrix from equation (47) for sharpness parameter values s₁ and s₂ associated with the j-th level and index j_(D) refers to the definition level of the smooth crease. In the left-hand side of equation (48), for the arguments s₁ and s₂, s₁=s₁(j_(D)) and s₂=s₂(j_(D)). As in the case of a subdivision surface defined by a triangular mesh, the matrix product in equation (48) converges to a matrix with identical rows, in this case each row being of size 2K+1. A vector of weight values l_(LP) for determining the position σ(q) of a limit point associated with vertex v_(q)(0) is obtained as follows: l _(lp)(s ₁ ,s ₂)=v _(LP) ·S _(sc,Q,K,L,LP)(s ₁ ,s ₂)  (49), where vector v_(LP) is a vector of weights that are used in determining the position of a limit point of a subdivision surface defined by a quadrilateral mesh in the absence of a smooth feature line, that is,

$\begin{matrix} {{v_{LP} = {\frac{1}{K\left( {K + 5} \right)}\left( {K^{2},4,\ldots\mspace{14mu},4,1,\ldots\mspace{14mu},1} \right)}},} & (50) \end{matrix}$ where, in equation (50), there are “K” components having the value “four” and “K” components with value “one.”

The components l_(LP)(s₁,s₂)_(i), i=0, . . . , 2K, of the row vector l_(LP)(s₁,s₂), and the positions c^(j)(0) of the vertex v_(q)(0) and c^(j)(i)(i=1, . . . , 2K) of the neighboring points v_(q)(i) are used to determine the position σ(q) of a limit point associated with the vertex v_(q)(0) as follows

$\begin{matrix} {{{\sigma(q)} = {\sum\limits_{i = 0}^{2K}{\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{i}{c^{j}(i)}}}},} & (51) \end{matrix}$ where, as suggested above, i∈q∪N_(e)(q, j)∪N_(f)(q, j) (reference FIG. 11).

As with the case of a subdivision surface defined by a triangular mesh, the components of the limit point weight vector l_(LP)(s₁,s₂) can be approximated using polynomial expansions. The components of limit point weight vector l_(LP)(s₁,s₂) can be satisfactorily approximated by second degree polynomials in s₁ and s₂ using six values per component and per valence. If the value of “K” is even, and if

${L = \frac{K}{2}},$ symmetry considerations allow the number of values per component to be reduced. In that case, the components of limit point weight vector l_(LP) satisfy the following symmetry relations:

-   -   1. the “i-th” component of limit point weight vector         l_(LP)(s₁,s₂) equals the “K+2-i-th” component of limit point         weight vector l_(LP)(s₁,s₂), that is,         (l_(LP)(s₁,s₂))_(l)=(l_(LP)(s₁,s₂))_(K+2−1), for i=2, . . . ,         K/2, and the “i-th” component of limit point weight vector         l_(LP)(s₁,s₂) equals the “3K+1-i-th” component of limit point         weight vector l_(LP)(s₁,s₂), that is,         (l_(lP)(s₁,s₂))_(i)=(l_(LP)(s₁,s₂))_(3K+1−i), for

$\begin{matrix} \; & {{i = {K + 1}},\ldots\mspace{11mu},{{K + \frac{K}{2}};}} & \; \\ 2. & {{\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{i} = \left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{\frac{K}{2} + 2 - i}},} & {{{{for}\mspace{14mu} i} = 1},\ldots\mspace{11mu},{\frac{K}{2} + 1},{and}} \\ \; & {{\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{i} = \left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{{2K} + \frac{K}{2} + 1 - i}},} & \; \\ \; & {{{{for}\mspace{14mu} i} = {K + 1}},\ldots\mspace{11mu},{{K + \frac{K}{2} + 1};}} & \; \end{matrix}$

-   -   3. (l_(LP)(s₁,s₂))₀=(l_(LP)(s₂,s₁))₀; and

$\begin{matrix} 4. & {{\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{\frac{K}{4} + 1} = \left( {l_{LP}\left( {s_{2},s_{1}} \right)} \right)_{\frac{K}{4} + 1}},} \end{matrix}$ if “K” is a multiple of “four,” and

${\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)_{K + {\lfloor\frac{K}{4}\rfloor} + 1} = \left( {l_{LP}\left( {s_{2},s_{1}} \right)} \right)_{K + {\lfloor\frac{K}{4}\rfloor} + 1}},$ if “K” is not a multiple of “four.” Given the symmetry relations described immediately above, it is only necessary to generate approximations for limit point weight vector l_(LP) for

${i = 0},\ldots\mspace{11mu},{\left\lfloor \frac{K}{4} \right\rfloor + 1}$ and

${i = {K + 1}},\ldots\mspace{11mu},{K + \left\lfloor \frac{K}{4} \right\rfloor + 1},$ and, in addition, symmetric polynomials can be used for i=0 for any even value of “K,” as well as for

$i = {\frac{K}{4} + 1}$ if “K” is a multiple of “four,” or

$i = {K + \left\lfloor \frac{K}{4} \right\rfloor + 1}$ if “K” is even but not a multiple of “four.”

As in the case of a subdivision surface defined by a triangular mesh, in one embodiment i the case of a subdivision surface defined by a quadrilateral mesh, regardless of whether

${L = \frac{K}{2}},$ the approximating polynomials are computed using a least-squares Chebyshev approximation methodology (reference equation (27) above). In this case, the coefficients b_(ij) (j=0, . . . , 3 in the symmetric case, or j=0, . . . , 5 in the asymmetric case) for the polynomial (l _(LP))_(l) ≈b _(i0) +b _(i1)(s ₁ +s ₂)+b _(i2)(s ₁ ² +s ₂ ²)+b _(i3) s ₁ s ₂  (52), in the symmetric case, or the polynomial (l _(LP))_(l) ≈b _(i0) +b _(i1) s ₁ +b _(i2) s ₂ +b _(i3) s ₁ ² +b _(i4) s ₁ s ₂ +b _(i5) s ₂ ²  (53), in the asymmetric case, are determined by a least squares methodology. FIG. 12 depicts a table of coefficients b_(ij) for K=4, L=2, for values of “i” i=0; 1; 2; 5. After the coefficients b_(ij) have been generated (equations (52) and (53)), they are used to generate the limit point weight vector l_(LP) in the same manner as in the case of a subdivision surface defined by a triangular mesh, which can be used to generate the position of the limit point σ(q) as described above in connection with equation (51).

The tangent vectors in the case of a subdivision surface defined by a quadrilateral mesh are generated in a manner similar to that used to generate tangent vectors in the case of a subdivision surface defined by a triangular mesh. Generally, in that methodology the matrix products S_(sc,Q,K,L,LP(J)(s) ₁,s₂) as described above (equation (48)) are generated, which are then

-   -   (1) multiplied by a vector v_(C), if tangent vector weight         vector l_(C) is being generated, or a vector v_(S), if tangent         vector weight vector l_(S) is being generated, and     -   (2) the result from (1) is thereafter multiplied by a dilation         factor that maintains the respective tangent vector in         normalized form,         as in the case of the tangent vector weight vectors in the case         of a triangular mesh. Initially, the vectors l_(C)(J)(s₁,s₂) and         l_(S)(J)(s₁,s₂) are generated as         l _(C)(s ₁ ,s ₂)=d(K)^(J) v _(C) ·S _(sc,Q,K,L,LP)(J)(s ₁ ,s ₂)         l _(S)(s ₁ ,s ₂)=d(K)^(J) v _(S) ·S _(sc,Q,K,L,LP)(J)(s ₁ ,s         ₂)  (54),

In the case of a subdivision surface defined by a quadrilateral mesh, the respective vectors v_(C) and v_(S) are given by

$\begin{matrix} {\left( v_{C} \right)_{i} = \left\{ {{\begin{matrix} 0 & {{{if}\mspace{14mu} i} = 0} \\ {A_{K}\;\cos\;\frac{2{\pi\left( {i - 1} \right)}}{K}} & {{{{if}\mspace{14mu} i} = 1},\ldots\mspace{11mu},K} \\ {{\cos\;\frac{2{\pi\left( {i - K - 1} \right)}}{K}} + {\cos\;\frac{2{\pi\left( {i - K} \right)}}{K}}} & {{{{if}\mspace{14mu} i} = {K + 1}},\ldots\mspace{11mu},{2K}} \end{matrix}\left( v_{S} \right)_{i}} = \left\{ {\begin{matrix} 0 & {{{if}\mspace{14mu} i} = 0} \\ {A_{K}\;\sin\;\frac{2{\pi\left( {i - 1} \right)}}{K}} & {{{{if}\mspace{14mu} i} = 1},\ldots\mspace{11mu},K} \\ {{\sin\;\frac{2{\pi\left( {i - K - 1} \right)}}{K}} + {\sin\;\frac{2{\pi\left( {i - K} \right)}}{K}}} & {{{{if}\mspace{14mu} i} = {K + 1}},\ldots\mspace{11mu},{2K}} \end{matrix},} \right.} \right.} & (55) \end{matrix}$ and the dilation factor is given as the reciprocal of the subdominant eigenvalue of the subdivision matrix (equation 47) for a smooth interior vertex:

$\begin{matrix} {{{d(K)} = \frac{1}{\frac{A_{K}}{16} + \frac{1}{4}}},} & (56) \end{matrix}$ where A_(K) is defined by

$\begin{matrix} {A_{K} = {1 + {\cos\left( \frac{2\pi}{K} \right)} + {{\cos\left( \frac{\pi}{K} \right)}{\sqrt{2\left( {9 + {\cos\;\frac{2\pi}{K}}} \right)}.}}}} & (57) \end{matrix}$

The tangent vector weight vectors l_(C) and l_(S) are used to generate the tangent vectors as follows:

$\begin{matrix} {{{e_{C}(q)} = {\sum\limits_{i = 0}^{2K}{\left( {l_{c}\left( {s_{1},s_{2}} \right)} \right)_{i}\;{c^{J}(i)}}}}{{{e_{S}(q)} = {\sum\limits_{i = 0}^{2K}{\left( {l_{S}\left( {s_{1},s_{2}} \right)} \right)_{i}\;{c^{J}(i)}}}},}} & (58) \end{matrix}$ where the indexing is as shown in FIG. 11.

As in the case of a subdivision surface defined by a triangular mesh, in the case of a subdivision surface defined by a quadrilateral mesh the tangent vector e_(C)(q) generated for a vertex v_(q)(0) generated using the tangent vector weight vector l_(C) will be oriented approximately along the smooth feature line through the limit point associated with the vertex v_(q)(0), and the tangent vector e_(S)(q) that is generated using the tangent vector weight vector l_(S) will be oriented approximately perpendicular to the smooth feature line through the limit point associated with the vertex v_(q)(0).

Also, as with the case of a subdivision surface defined by a triangular mesh, the tangent vector weight vectors in the case of a subdivision surface defined by a quadrilateral mesh can be approximated using polynomial approximations. The components of tangent vector weight vectors l_(C)(s₁,s₂) and l_(S)(s₁,s₂) can be satisfactorily approximated by third degree polynomials in s₁ and s₂ using, in general, ten values per component and per valence If the value of “K” is even, and if

${L = \frac{K}{2}},$ symmetry considerations allow the number of values per component to be reduced. In that case, the components of tangent vector weight vector l_(C) satisfy the following symmetry relations:

-   -   1. the “i-th” component of tangent vector weight vector         l_(C)(s₁,s₂) equals the “K+2-i-th” component of tangent vector         weight vector tangent vector weight vector l_(C)(s₁,s₂), that         is, (l_(C)(s₁,s₂₎₎ _(i)=(l_(C)(s₁,s₂))_(K+2−1), for i=2, . . . ,         K/2 and the “i-th” component of tangent vector weight vector         l_(C)(s₁,s₂) equals the “3K+1-i-th” component of tangent vector         weight vector l_(C)(s₁,s₂), that is,         (l_(C)(s₁,s₂))_(l)=(l_(C)(s₁,s₂))_(3K+1-i), for

$\begin{matrix} {{i = {K + 1}},\ldots\mspace{11mu},{{K + \frac{K}{2}};}} & \; & \; \\ {{\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{i} = {- \left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{\frac{K}{2} + 2 - i}}},} & {{{{for}\mspace{14mu} i} = 1},\ldots\mspace{11mu},{\frac{K}{2} + {1k}},\mspace{14mu}{and}} & \; \\ {{\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{i} = {- \left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{{2K} + \frac{K}{2} + 1 - i}}},} & {{{{for}\mspace{14mu} i} = {K + 1}},{{{\ldots\mspace{11mu}.K} + \frac{K}{2} + 1};}} & \; \\ {{\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{0} = {- \left( {l_{C}\left( {s_{2},s_{1}} \right)} \right)_{0}}};\mspace{14mu}{and}} & \; & \; \\ {{\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{\frac{K}{4} + 1} = {- \left( {l_{C}\left( {s_{2},s_{1}} \right)} \right)_{\frac{K}{4} + 1}}},} & \; & \; \end{matrix}$ if “K” is a multiple of “four,” and

${\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{K + {\lfloor\frac{K}{4}\rfloor} + 1} = {- \left( {l_{C}\left( {s_{2},s_{1}} \right)} \right)_{K + {\lfloor\frac{K}{4}\rfloor} + 1}}},$ if “K” is not a multiple of “four.” Given the symmetry relations described immediately above, it is only necessary to generate approximations for

${i = 0},\ldots\mspace{11mu},{\left\lfloor \frac{K}{4} \right\rfloor + 1}$ and

${i = {K + 1}},\ldots\mspace{11mu},{K + \left\lfloor \frac{K}{4} \right\rfloor + 1},$ and, in addition, anti-symmetric polynomials can be used for i=0 for any even value of “K,” as well as for

$i = {\frac{K}{4} + 1}$ if “K” is a multiple of “four,” or

$i = {K + \left\lfloor \frac{K}{4} \right\rfloor + 1}$ if “K” is even but not a multiple of “four.”

As in the case of a subdivision surface defined by a triangular mesh, in one embodiment, the approximating polynomials are also computed using a least squares Chebyshev approximation methodology similar to that used in connection with the limit point approximation described above. The matrix product of equation (48) is evaluated at points of a grid in the (s₁,s₂) region made up of roots of Chebyshev polynomials (equation (27)). In this case, the coefficients b_(ij) (j=0, . . . , 3, in the anti-symmetric case, or j=0, . . . , 9, in the non-symmetric case) for the polynomial (l _(C))_(i) ≈b _(i0)(s ₁ −s ₂)+b _(i1)(s ₁ ² −s ₂ ²)+b _(i2)(s ₁ ³ −s ₂ ³)+b _(i3)(s₁ ² s ₂ −s ₁ s ₂ ²)  (59), in the anti-symmetric case, or the polynomial (l _(C))_(l) ≈b _(i0) +b _(i1) s ₁ +b _(l2) s ₂ +b _(i3) s ₁ ² +b _(i4) s ₁ s ₂ +b _(i5) s ₂ ² +b _(i6) s ₁ ³ +b _(i7) s ₁ ² s ₂ +b _(i8) s ₁ s ₂ ² +b _(i9) s ₂ ³  (60), in the non-symmetric case, are determined using the least squares methodology. Operations performed in connection with the least squares methodology correspond to those described above in the case of a subdivision surface defined by a triangular mesh. The components of tangent vector weight vector is can be approximated as l_(S)(s₁,s₂) using third degree polynomials in sharpness parameters s₁ and s₂. The operations performed in generating the coefficients for the polynomials correspond to the operations performed in generating the coefficients for the polynomials described above for the tangent vector weight vector l_(C) used in generating the tangent vector along the smooth feature line. FIG. 13 depicts a table of coefficients b_(ij) for K=4, L=2, corresponding to i=0; 1; 2; 5.

After the tangent vector weight vectors l_(C) and l_(S) have been generated, they are used to generate the tangent vectors e_(C) and e_(S) as described above in connection with equation (58).

As in the case of a subdivision surface defined by a triangular mesh, in some circumstances, it is impractical to use polynomials to generate approximations for limit point weight vector l_(LP) and tangent vector weight vectors l_(C) and l_(S). An alternative methodology makes use of polynomial extrapolation to generate approximations for limit point weight vector l_(LP) and tangent vector weight vectors l_(C) and l_(S). This extrapolation methodology is similar to the methodology described above in connection with equations 38-46.

Operations performed by the computer graphics system 10 in connection with generating the limit point weight vector l_(LP) and tangent vector weight vectors l_(C) and l_(S) for a subdivision surface defined by a quadrilateral mesh, using the polynomial extrapolation methodology, are similar to those described above in connection with FIG. 10 for a subdivision surface defined by a triangular mesh, and reference should be made to FIG. 10 for that description.

The arrangement provides a number of advantages. In particular, the invention provides an arrangement for generating a subdivision surface from a representation defined by a control mesh at a selected level, by applying the same parameterized subdivision rule at each level, with the value(s) of the parameter(s) varying at at least some of the levels. The invention specifically provides for the generation of a smooth feature line in a subdivision surface using the same parameterized subdivision rule at each level, with the value(s) of the parameter(s) defining the smooth feature line varying at at least some of the levels. The resulting subdivision surface is of relatively high quality and can be efficiently evaluated.

It will be appreciated that numerous changes and modifications may be made to the arrangement as described herein. For example, it will be appreciated that, although the arrangement has been described in connection with meshes of triangular and quadrangular faces, it will be appreciated that the arrangement may find utility in connection with meshes having faces of different polygonal structures.

Furthermore, although specific subdivision rules (equations (19) and (46)) have been described, it will be appreciated that other subdivision rules may find utility.

In addition, although a methodology has been described for updating the sharpness parameters s₁ and s₂, and although various methodologies have been described for approximating weight vectors l_(LP), l_(C) and l_(S), it will be appreciated that other parameter update and approximation methodologies may find utility.

Furthermore, in connection with the extrapolation methodologies described herein, it will be appreciated that the number of coefficients b_(J), and the upper limit (“three”) on the summations in equations (41) and (46) may differ if a polynomial other than of order “three” is used in the extrapolation.

It will be appreciated that a system in accordance with the invention can be constructed in whole or in part from special purpose hardware or a general purpose computer system, or any combination thereof, any portion of which may be controlled by a suitable program. Any program may in whole or in part comprise part of or be stored on the system in a conventional manner, or it may in whole or in part be provided in to the system over a network or other mechanism for transferring information in a conventional manner. In addition, it will be appreciated that the system may be operated and/or otherwise controlled by means of information provided by an operator using operator input elements (not shown) which may be connected directly to the system or which may transfer the information to the system over a network or other mechanism for transferring information in a conventional manner.

The foregoing description has been limited to a specific embodiment of this invention. It will be apparent, however, that various variations and modifications may be made to the invention, with the attainment of some or all of the advantages of the invention. It is the object of the appended claims to cover these and such other variations and modifications as come within the true spirit and scope of the invention.

What is claimed as new and desired to be secured by Letters Patent of the United States is: 

1. A method executable in a computer graphics system to enable the computer graphics system to generate a representation of a feature in a surface defined by a mesh representation, the mesh comprising at a selected level a plurality of points including at least one point connected to a plurality of neighboring points by respective edges, the feature being defined in connection with the vertex and at least one of the neighboring points and the edge interconnecting the vertex and the at least one of the neighboring points in the mesh representation, the method comprising: A. generating at least one weight vector based on a parameterized subdivision rule defined at a plurality of levels, for which a value of at least one parameter differs at at least two levels in the mesh; and B. using the at least one weight vector and positions of the vertex and the neighboring points to generate the representation of the feature; wherein the feature is a smooth feature line; wherein the smooth feature line is defined in connnection with the vertex and two neighboring points and edges interconnecting the vertex and the respective neighboring points, the generating at least one weight vector comprising using a parameterized subdivision rule having a parameter value associated with each of the edges along which the smooth feature line is defined; wherein the mesh comprises a triangular mesh in which, at a selected level “j,” vertex v_(q)(0) is at position c^(j)(0) and neighboring points v_(q)(k), k=1, . . . , K are at respective positions c^(j)(k), and further comprising using a parameterized subdivision rule S_(sc,T,K,L) that relates the position c^(j+1)(0) of the vertex v_(q)(0) and positions c^(j+1)(k) of neighboring points v_(q)(k) at the next higher level “j+1” as follows: c^(j+1)=S_(sc,T,K,L)c^(j) where subdivision rule S_(sc,T,K,L) is given by: $\left( {S_{x,\tau,\kappa,l}\left( {s_{1},s_{2}} \right)} \right)_{l,m} = \left\{ \begin{matrix} {{\left( {1 - s_{3}} \right)\left( {1 - {a(K)}} \right)} + {\frac{3}{4}s_{3}}} & {{{{if}\mspace{20mu} l} = \; 0},{m = 0}} \\ {{\left( {1 - s_{3}} \right)\frac{a(K)}{K}} + {\frac{1}{8}s_{3}}} & {{{{if}\mspace{14mu} l} = 0},{m = {{1\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\left( {1 - s_{3}} \right)\frac{a(K)}{K}} & {{{{if}\mspace{14mu} l} = 0},{m = 2},\ldots\mspace{14mu},L} \\ \; & {{{{or}\mspace{14mu} l} = 0},{m = {L + 2}},\ldots\mspace{14mu},K} \\ {\frac{3}{8} + {\frac{1}{8}s_{2}}} & {{{{if}\mspace{14mu} l} = 1},{m = {0\mspace{14mu}{or}\mspace{14mu} 1}}} \\ {\frac{3}{8} + {\frac{1}{8}s_{1}}} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = {{0\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\frac{1}{8}\left( {1 - s_{2}} \right)} & {{{{if}\mspace{14mu} l} = 1},{m = {2\mspace{14mu}{or}\mspace{14mu} K}}} \\ {\frac{1}{8}\left( {1 - s_{1}} \right)} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = {{L\mspace{14mu}{or}\mspace{14mu} L} + 2}}} \\ \frac{3}{8} & {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = 0}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = 0}} \\ \; & {{{{or}\mspace{14mu} l} = {m = 2}},\ldots\mspace{14mu},L} \\ \; & {{{{or}\mspace{14mu} l} = {m = {L + 2}}},\ldots\mspace{14mu},K} \\ \frac{1}{8} & {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {l + 1}}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {l + 1}}} \\ \; & {{{{or}\mspace{14mu} l} = K},{m = 1}} \\ 0 & {otherwise} \end{matrix} \right.$ where the smooth feature line is defined in connection with the edges between respective points v_(q)(1) and v_(q)(L+1)(L+1≦K) and vertex v_(q)(0), s_(l) is the parameter associated with the edge between point v_(q)(1) and vertex v_(q)(0), s₂ is the parameter associated with the edge between point v_(q)(L+1) and vertex ${v_{q}(0)},{s_{3} = {\frac{1}{2}\left( {s_{1} + s_{2}} \right)}},{{{and}\mspace{14mu}{a(K)}} = {\frac{5}{8} - {\left( \frac{3 + {2\;{\cos\left( \frac{2\pi}{K} \right)}}}{8} \right)^{2}.}}}$
 2. The method of claim 1 in which the representation of the feature is defined by at least one limit point associated with the vertex, and further comprising determining a position σ(q) of the limit point in accordance with ${{\sigma(q)} = {\sum\limits_{i = 0}^{K}\left( {l_{LP}\left( {s_{1},s_{2}} \right)} \right)}},{c^{j}(i)},$ where l_(LP)(s₁s₂) is a vector of limit point weight values defined by l _(LP)(s ₁ ,s ₂)=v _(LP) ·S _(sc,T,K,L,LP)(s ₁ ,s ₂) where ${{S_{{sc},T,K,L,{LP}}\left( {s_{1},s_{2}} \right)} = {\prod\limits_{j = \infty}^{j_{o}}\;{S_{{sc},T,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}}},$ where S_(sc,T,K,L) (s₁(j),s₂(j)) corresponds to S_(sc,T,K,L) for sharpness parameters corresponding to the “j-th” level in the matrix product, where S_(sc,T,K,L,LP)(s₁,s₂) arguments s₁ an s₂ on the left-hand side refer to the sharpness parameters a definition level of the smooth feature line and the subscript “LP” refers to “Limit Point,” and ${v_{LP} = \left( {\frac{\omega(K)}{{\varpi(K)} + K},\frac{1}{{\varpi(K)} + K},\frac{1}{{\varpi(K)} + K},\ldots\mspace{14mu},\frac{1}{{\varpi(K)} + K}} \right)},{where}$ ${\varpi(K)} = {\frac{3K}{8{a(K)}}.}$
 3. The method of claim 2 further comprising generating an approximation for the limit point weight vector l_(LP) using a polynomial approximation methodology.
 4. The method of claim 3 further comprising generating the approximation for the limit point weight vector l_(LP) in accordance with the polynomial (l _(LP))_(i)≈b _(i0) +b _(i1)(s ₁ +s ₂)+b _(i2)(s ₁ ² +s ₂ ²)+b _(i3) s ₁ s ₂ in a symmetric case, or the polynomial (l _(LP))_(i)≈b _(i0) +b _(i1) s ₁ +b _(i2) s ₂ +b _(i3) s ₁ ² +b _(i4) s ₂ ² +b _(i5) s ₁ s ₂ in an asymmetric case, in which the coefficients b_(ij) are determined by a least squares methodology and the values of the parameters s₁ and s₂ are at selected values.
 5. The method of claim 4 further comprising selecting values of s₁ and s₂ in accordance with ${\left( {s_{1},s_{2}} \right) = \left( {{\cos\left( \frac{\left( {i + \frac{1}{2}} \right)\pi}{N} \right)},{\cos\left( \frac{\left( {j + \frac{1}{2}} \right)\pi}{N} \right)}} \right)},$ where “N” is a selected integer, and indices i,j=0, . . . ,N−1.
 6. The method of claim 2 further comrising generating an approximation for the limit point weight vector l_(LP) using an extrapolation approximation methodology in relation to an M-degree polynomial that interpolates the points {x=2⁻² ^(j) , y=l _(LP)(J)},J=0, . . . , M and then evaluates this polynomial by extrapolation at the point x=0.
 7. The method of claim 6 further comprising performing the extrapolation approximation methodology such that M=3.
 8. The method of claim 7 further comprising generating the approximation for the limit point weight vector weight vector in accordance with ${l_{LP} \approx {\sum\limits_{j = 0}^{3}{b_{J}{l_{LP}(J)}}}},$ where “J” is a predetermined integer and where (l _(LP)(J)s ₁ ,s ₂))_(m)=(s _(sc,T,K,L,LP)(J)(s ₁ ,s ₂))_(l,m) where ${{{S_{{sc},T,K,L,{LP}}(J)}\left( {s_{1},s_{2}} \right)}:={\prod\limits_{j = J}^{0}\;{S_{{sc},T,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}}},$ with S _(sc,T,K,L,LP)(0)(s ₁ ,s ₂)=I _(K+l) where I_(k+1) is the “K+1” by “K+1” identity matrix, and where $b_{0} = {{\frac{- 135}{120015}\mspace{25mu} b_{1}} = {{\frac{1270}{120015}\mspace{25mu} b_{2}} = {{\frac{- 12192}{120015}\mspace{25mu} b_{3}} = {\frac{131072}{120015}.}}}}$
 9. The method of claim 1 in which the representation of the feature is defined by a tangent vector associated with the vertex, the tangent vector being along the smooth feature line, and further comprising determining the tangent vector e_(C)(q) in accordance with ${{e_{C}(q)} = {\sum\limits_{i = 0}^{K}{\left( {l_{C}\left( {s_{1},s_{2}} \right)} \right)_{i}{c^{j}(i)}}}},$ where I_(C)(s₁,s₂) is a vector of tangent vector weight values defined by ${l_{C} = {\lim_{j\rightarrow\infty}\frac{l_{C}(J)}{{l_{C}(J)}}}},{{{where}\mspace{14mu}{v}} = \sqrt{\sum\limits_{i}v_{i}^{2}}},$ that is, the Euclidean norm, and where ${{l_{C}(J)} = {\left( {0,1,0,\ldots\mspace{14mu},{- 1},0,\ldots} \right) \cdot {\prod\limits_{j = J}^{j_{o}}\;{S_{{sc},T,K,L}\left( {{s_{1}(j)},{s_{2}(j)}} \right)}}}},$ where two non-zero components of the row vector on the right hand side are a “one” at position “one” in the row vector, and a “negative one” at position ${\frac{K}{2} + 1},$ and where S_(sc,T,K,L) (s₁(j), s₂(j)) corresponds to S_(sc,T,K,L) for sharpness parameters corresponding to the “j-th” level in the matrix product.
 10. A method executable in a computer graphics system to enable the computer graphics system to generate a representation of a feature in a surface defined by a mesh representation, the mesh comprising at a selected level a plurality of points including at least one point connected to a plurality of neighboring points by respective edges, the feature being defined in connection with the vertex and at least one of the neighboring points and the edge interconnecting the vertex and the at least one of the neighboring points in the mesh representation, the method comprising: A. generating at least one weight vector based on a parameterized subdivision rule defined at a plurality of levels, for which a value of at least one parameter differs at at least two levels in the mesh; and B. using the at least one weight vector and positions of the vertex and the neighboring points to generate the representation of the feature; wherein the feature is a smooth feature line; wherein the smooth feature line is defined in connection with the vertex and two neighboring points and edges interconnecting the vertex and the respective neighboring points, wherein the generating at least one weight vector comprises using a parameterized subdivision rule having a parameter value associated with each of the edges along which the smooth feature line is defined; and wherein the mesh comprises a quadrilateral mesh in which, at a selected level “j,” vertex v_(q)(0) is at position c^(j)(0) and neighboring points v_(q)(k) k=; 1, . . . , 2K are at respective positions c^(j)(k), and further comprising using a parameterized subdivision rule S_(sc,Q,K,L) that relates the position c^(j+1)(0) of the vertex v_(q)(0) and positions c^(j+1)(k) of neighboring points v_(q)(k) at the next higher level “j+1” as follows c^(j+1)=S_(sc,T,K,L)c^(j) where subdivision rule S_(sc,Q,K,L) is given by $\left( {s_{{sc},Q,K,L}\left( {s_{1},s_{2}} \right)} \right)_{l,m} = \left\{ \begin{matrix} {{{\left( {1 - s_{3}} \right)\left( {1 - \frac{7}{4\; K}} \right)} + {\frac{3}{4}s}},} & {{{{if}\mspace{14mu} l} = 0},{m = 0}} \\ {{\left( {1 - s_{3}} \right)\left( \frac{3}{2\; K^{2}} \right)} + {\frac{1}{8}s_{3}}} & {{{{if}\mspace{14mu} l} = 0},{m = {{1\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\left( {1 - s_{3}} \right)\left( \frac{3}{4K^{2}} \right)} & {{{{if}\mspace{14mu} l} = 0},{m = 2},\ldots\mspace{14mu},L} \\ \; & {{{{or}\mspace{14mu} l} = 0},{m = {L + 2}},\ldots\mspace{14mu},K} \\ {\left( {1 - s_{3}} \right)\left( \frac{1}{4K^{2}} \right)} & {{{{if}\mspace{14mu} l} = 0},{m = {K + 1}},\ldots\mspace{14mu},{2K}} \\ {{\frac{3}{8}\left( {1 - s_{2}} \right)} + {\frac{1}{2}s_{2}}} & {{{{if}\mspace{14mu} l} = 1},{m = {0\mspace{14mu}{or}\mspace{14mu} 1}}} \\ \; & {{{{if}\mspace{14mu} l} = {L + 1}},{m = 2},K,} \\ {\frac{1}{16}\left( {1 - s_{2}} \right)} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = 2},K,} \\ \; & {K + {1\mspace{14mu}{or}\mspace{14mu} 2K}} \\ {{\frac{3}{8}\left( {1 - s_{1}} \right)} + {\frac{1}{2}s_{1}}} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = {{0\mspace{14mu}{or}\mspace{14mu} L} + 1}}} \\ {\frac{1}{16}\left( {1 - s_{1}} \right)} & {{{{if}\mspace{14mu} l} = {L + 1}},{m = L},{L = 2},} \\ \; & {K + {1\mspace{14mu}{or}\mspace{14mu} K} + L + 1} \\ \frac{3}{8} & {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = 0}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = 0}} \\ \; & {{{{or}\mspace{14mu} l} = {m = 2}},\ldots\mspace{14mu},L} \\ \; & {{{{or}\mspace{14mu} l} = {m = {L + 2}}},\ldots\mspace{14mu},K} \\ \frac{1}{16} & {{{{if}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {l + 1}}} \\ \; & {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {K + l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = 2},\ldots\mspace{14mu},L,{m = {K + l}}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},{K - 1},{m = {l + 1}}} \\ \; & {{{{or}\mspace{14mu} l} = K},{m = 1}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {K + l - 1}}} \\ \; & {{{{or}\mspace{14mu} l} = {L + 2}},\ldots\mspace{14mu},K,{m = {K + l}}} \\ \frac{1}{4} & {{{{if}\mspace{14mu} l} = {K + 1}},\ldots\mspace{14mu},{{2K} - 1},{m = 0},} \\ \; & {{l - K},{l - K + {1\mspace{14mu}{or}\mspace{14mu} l}}} \\ \; & {{{{or}\mspace{14mu} l} = {2K}},{m = 0},K,{1\mspace{14mu}{or}\mspace{14mu} 2K}} \\ 0 & {otherwise} \end{matrix} \right.$ where the smooth feature line is defined in connection with the edges between respective points v_(q)(1) and v_(q)(L+1)(L+1≦2K) and vertex v_(q)(0), s₁ is the parameter associated with the edge between point v_(q)(1) and vertex v_(q)(0), s₂ is the parameter associated with the edge between point v_(q)(L+1) and vertex v_(q)(0), and $s_{3} = {\frac{1}{2}{\left( {s_{1} + s_{2}} \right).}}$
 11. A method executable in a computer graphics system operable to generate representations of features and objects and to generate therefrom images of the features and objects, the method being executable to generate a representation of a feature in a surface defined by a mesh representation, the mesh comprising at a selected level a pluralty of points including at least one point connected to a plurality of neighboring points by respective edges, the feature being defined in connection with the vertex and at least one of the neighboring points and the edge interconnecting the vertex and the at least one of the neighboring points in the mesh representation, the method comprising: A generating at least one weight vecter based on a parameterized subdivision rule defined at a plurality of levels, for which a value of at least one parameter differs at at least two levels in the mesh; and B. using the at least one weight vector and postions of the vertex and the neighboring points generating, the representation of the feature; wherein the feature is a smooth feature line; wherein the smooth feature line is defined in connection with the vertex and two neighboring points and edges interconnecting the vertex and the respective neighboring points; wherein the generating of at least one weight vector comprises utilizing: (1) a parameterized subdivision rule having a parameter value associated with each of the edges along which the smooth feature line is defined; (2) parameters associated with the edges along which the smooth feature line is defined whose values differ; and (3) parameters that are in relation to a subdivision rule that, in turn, reflects a sharp crease along the edges along which the smooth feature line is defined, the values of the parameters being defined in the interval [0.1], where higher values define a sharper crease, the values of the parameters at a lower level being related to the values of the parameters at a higher level being related by ${{s_{1}\left( {j + 1} \right)} = \left( {{\frac{3}{4}{s_{1}(j)}} + {\frac{1}{4}{s_{2}(j)}}} \right)^{2}},{{{and}\mspace{14mu}{s_{2}\left( {j + 1} \right)}} = \left( {{\frac{1}{4}{s_{j}(j)}} + {\frac{3}{4}{s_{2}(j)}}} \right)^{2}},$ where s₁(j) and s₂(j) represent the values of the parameters associated with the respective edges at level “j,” and s₁(j+1) and s₂(j+1) represent the values of the parameters associated with the respective edges at the higher level “j+1.” 